13 research outputs found
Quantum walks on Cayley graphs
We address the problem of the construction of quantum walks on Cayley graphs.
Our main motivation is the relationship between quantum algorithms and quantum
walks. In particular, we discuss the choice of the dimension of the local
Hilbert space and consider various classes of graphs on which the structure of
quantum walks may differ. We completely characterise quantum walks on free
groups and present partial results on more general cases. Some examples are
given, including a family of quantum walks on the hypercube involving a
Clifford Algebra.Comment: J. Phys. A (accepted for publication
Bounds for mixing time of quantum walks on finite graphs
Several inequalities are proved for the mixing time of discrete-time quantum
walks on finite graphs. The mixing time is defined differently than in
Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for
particular examples of walks on a cycle, a hypercube and a complete graph,
quantum walks provide no speed-up in mixing over the classical counterparts. In
addition, non-unitary quantum walks (i.e., walks with decoherence) are
considered and a criterion for their convergence to the unique stationary
distribution is derived.Comment: This is the journal version (except formatting); it is a significant
revision of the previous version, in particular, it contains a new result
about the convergence of quantum walks with decoherence; 16 page
Quantum transport on two-dimensional regular graphs
We study the quantum-mechanical transport on two-dimensional graphs by means
of continuous-time quantum walks and analyse the effect of different boundary
conditions (BCs). For periodic BCs in both directions, i.e., for tori, the
problem can be treated in a large measure analytically. Some of these results
carry over to graphs which obey open boundary conditions (OBCs), such as
cylinders or rectangles. Under OBCs the long time transition probabilities
(LPs) also display asymmetries for certain graphs, as a function of their
particular sizes. Interestingly, these effects do not show up in the marginal
distributions, obtained by summing the LPs along one direction.Comment: 22 pages, 11 figure, acceted for publication in J.Phys.
Almost uniform sampling via quantum walks
Many classical randomized algorithms (e.g., approximation algorithms for
#P-complete problems) utilize the following random walk algorithm for {\em
almost uniform sampling} from a state space of cardinality : run a
symmetric ergodic Markov chain on for long enough to obtain a random
state from within total variation distance of the uniform
distribution over . The running time of this algorithm, the so-called {\em
mixing time} of , is , where
is the spectral gap of .
We present a natural quantum version of this algorithm based on repeated
measurements of the {\em quantum walk} . We show that it
samples almost uniformly from with logarithmic dependence on
just as the classical walk does; previously, no such
quantum walk algorithm was known. We then outline a framework for analyzing its
running time and formulate two plausible conjectures which together would imply
that it runs in time when is
the standard transition matrix of a constant-degree graph. We prove each
conjecture for a subclass of Cayley graphs.Comment: 13 pages; v2 added NSF grant info; v3 incorporated feedbac
Recurrence of biased quantum walks on a line
The Polya number of a classical random walk on a regular lattice is known to
depend solely on the dimension of the lattice. For one and two dimensions it
equals one, meaning unit probability to return to the origin. This result is
extremely sensitive to the directional symmetry, any deviation from the equal
probability to travel in each direction results in a change of the character of
the walk from recurrent to transient. Applying our definition of the Polya
number to quantum walks on a line we show that the recurrence character of
quantum walks is more stable against bias. We determine the range of parameters
for which biased quantum walks remain recurrent. We find that there exist
genuine biased quantum walks which are recurrent.Comment: Journal reference added, minor corrections in the tex
Evanescence in Coined Quantum Walks
In this paper we complete the analysis begun by two of the authors in a
previous work on the discrete quantum walk on the line [J. Phys. A 36:8775-8795
(2003) quant-ph/0303105 ]. We obtain uniformly convergent asymptotics for the
"exponential decay'' regions at the leading edges of the main peaks in the
Schr{\"o}dinger (or wave-mechanics) picture. This calculation required us to
generalise the method of stationary phase and we describe this extension in
some detail, including self-contained proofs of all the technical lemmas
required. We also rigorously establish the exact Feynman equivalence between
the path-integral and wave-mechanics representations for this system using some
techniques from the theory of special functions. Taken together with the
previous work, we can now prove every theorem by both routes.Comment: 32 pages AMS LaTeX, 5 figures in .eps format. Rewritten in response
to referee comments, including some additional references. v3: typos fixed in
equations (131), (133) and (134). v5: published versio
The effect of large-decoherence on mixing-time in Continuous-time quantum walks on long-range interacting cycles
In this paper, we consider decoherence in continuous-time quantum walks on
long-range interacting cycles (LRICs), which are the extensions of the cycle
graphs. For this purpose, we use Gurvitz's model and assume that every node is
monitored by the corresponding point contact induced the decoherence process.
Then, we focus on large rates of decoherence and calculate the probability
distribution analytically and obtain the lower and upper bounds of the mixing
time. Our results prove that the mixing time is proportional to the rate of
decoherence and the inverse of the distance parameter (\emph{m}) squared.
This shows that the mixing time decreases with increasing the range of
interaction. Also, what we obtain for \emph{m}=0 is in agreement with
Fedichkin, Solenov and Tamon's results \cite{FST} for cycle, and see that the
mixing time of CTQWs on cycle improves with adding interacting edges.Comment: 16 Pages, 2 Figure
Locality for quantum systems on graphs depends on the number field
Adapting a definition of Aaronson and Ambainis [Theory Comput. 1 (2005),
47--79], we call a quantum dynamics on a digraph "saturated Z-local" if the
nonzero transition amplitudes specifying the unitary evolution are in exact
correspondence with the directed edges (including loops) of the digraph. This
idea appears recurrently in a variety of contexts including angular momentum,
quantum chaos, and combinatorial matrix theory. Complete characterization of
the digraph properties that allow such a process to exist is a long-standing
open question that can also be formulated in terms of minimum rank problems. We
prove that saturated Z-local dynamics involving complex amplitudes occur on a
proper superset of the digraphs that allow restriction to the real numbers or,
even further, the rationals. Consequently, among these fields, complex numbers
guarantee the largest possible choice of topologies supporting a discrete
quantum evolution. A similar construction separates complex numbers from the
skew field of quaternions. The result proposes a concrete ground for
distinguishing between complex and quaternionic quantum mechanics.Comment: 9 page
Multi-walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more naturally to some physical implementations, such as linear optics. Numerous authors have considered walks with one or two walkers, on one-dimensional graphs, and several experimental demonstrations have been performed. In this paper, we discuss generalizing the model of discrete time quantum walks to the case of an arbitrary number of walkers acting on arbitrary graph structures. We present a formalism that allows for the analysis of such situations, and several example scenarios for how our techniques can be applied. We consider the most important features of quantum walks-measurement, distinguishability, characterization and the distinction between classical and quantum interference. We also discuss the potential for physical implementation in the context of linear optics, which is of relevance to present-day experiments